A robust optimization approach for disassembly assembly routing problem under uncertain yields

This study examines a stochastic disassembly assembly routing problem with returns (SDARP-R), in which yields are considered uncertain due to the unknown status of returned products. We introduce new formulation for robust SDARP-R defined by discrete scenarios. address five hypotheses, where different levels decision flexibility given. Analyses indicate that allowing procurement process improves total cost but increases difficulty solving problem, as well. However, only purchasing decisions is most practical industry. An efficient matheuristic method based on integer programming and Variable Neighborhood Search algorithm also developed. The performance evaluated through numerical tests, under three promising hypothesis.